| 翻訳と辞書 |
Irit Dinur
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science.〔(Faculty listing ), Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.〕 Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.〔(Research interests of faculty members ), Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.〕
Dinur earned her doctorate in 2002 from the school of computer science in Tel-Aviv University, advised by Shmuel Safra; her thesis was entitled ''On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice''.〔(School of Computer Science Thesis Repository ), Tel-Aviv University, accessed 2014-06-18.〕 She joined the Weizmann Institute after visiting the Institute of Advanced Studies in Princeton, New Jersey, NEC, and the University of California, Berkeley.
Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result.〔.〕
In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv.〔(Michael Bruno Memorial Award recipients ), retrieved 2014-06-18.〕 She was a plenary speaker at the 2010 International Congress of Mathematicians.〔(ICM2010 — Avila, Dinur, plenary lectures ), Tim Gowers, August 30, 2010.〕 In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union.〔(EMS e-News 4, September 2012 ), European Mathematical Society, retrieved 2014-06-18.〕 She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.〔(Irit Dinur ), Radcliffe Institute for Advanced Study, Harvard University, retrieved 2014-06-18.〕
==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Irit Dinur」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|